Location:
Search - prim algorithm
Search list
Description: 数据结构中的最小生成树实现，根据核心算法在Visual studio6.0的开发环境中运行成功。-Data structure to achieve the minimum spanning tree, according to the core algorithm in the development environment Visual studio6.0 run successfully.
Platform: |
Size: 1024 |
Author: 夏之星 |
Hits:
Description: prim算法构造最小生成树，调试通过，c++语言编写。-Minimum Spanning Tree Algorithm prim, debugging through, c++ languages.
Platform: |
Size: 1024 |
Author: zhlohi |
Hits:
Description: 这是一个数据结构c语言的最小生成树的程序代码。用的是普里姆算法实现的-This is a data structure of the minimum spanning tree c language program code. Prim algorithm is used to achieve the
Platform: |
Size: 1024 |
Author: 杨晓华 |
Hits:
Description: Prim算法完整实现代码收藏
用Prim算法求无向图的最小生成树
-Prim algorithm to achieve a complete collection of code using Prim algorithm for undirected graph of the minimum spanning tree
Platform: |
Size: 43008 |
Author: 曾冬梅 |
Hits:
Description: 1． 利用克鲁斯卡尔算法求网的最小生成树。
2． 利用普里姆算法求网的最小生成树。
3． 要求输出各条边及它们的权值。
-1. Using Kruskal' s algorithm for minimum spanning tree network. 2. Prim algorithm for the use of the minimum spanning tree network. 3. Requirements of the output of each side, and their weights.
Platform: |
Size: 20480 |
Author: XH |
Hits:
Description: Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.
Platform: |
Size: 1024 |
Author: mr_pupu |
Hits:
Description: Minimum Spanning Tree implementation using kruskal and prims algorithm.
Platform: |
Size: 2048 |
Author: shi |
Hits:
Description: 构造最小生成树的常用方法是Prim算法与Kruskal算法，二者都是基于贪心算法设计侧略。-Construction of the commonly used minimum spanning tree algorithm is Prim and Kruskal algorithms, both are based on the design side of a little greedy algorithm.
Platform: |
Size: 1024 |
Author: workfuture |
Hits:
Description: 最小生成树C语言描述，采用了Prim算法，提高程序运行速度-C language to describe the minimum spanning tree, using Prim algorithm, improve the running speed
Platform: |
Size: 1024 |
Author: 李杰 |
Hits:
Description: Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.
Platform: |
Size: 1024 |
Author: kenny |
Hits:
Description: prim s algorithm implementation in C++ with graphical output
Platform: |
Size: 2048 |
Author: diksha |
Hits:
Description: 依据prim最小生成树的算法实现的最小生成树源码，能够建立准确的最小代价生成树-Prim minimum spanning tree based on the minimum spanning tree algorithm source code, be able to establish an accurate minimum cost spanning tree
Platform: |
Size: 11264 |
Author: fengyunlucky |
Hits:
Description: 用prim算法求最小生成树.C语言中关于图一章的很好的理解例子。对初学者很有用。-Seek the minimum spanning tree with the prim algorithm. C language on the map a good understanding of the chapter examples. Very useful for beginners.
Platform: |
Size: 272384 |
Author: 肖叶枝 |
Hits:
Description: pku 2485
use the prim algorithm
Platform: |
Size: 5120 |
Author: lili |
Hits:
Description: 输入含权图的邻接矩阵，输出最小生成树的邻接矩阵
1、本实验用到的理论知识
Prim算法
算法设计
设图G =（V，E），其生成树的顶点集合为U。
①、把v0放入U。
②、在所有u∈U，v∈V-U的边(u，v)∈E中找一条最小权值的边，加入生成树。
③、把②找到的边的v加入U集合。如果U集合已有n个元素，则结束，否则继续执行②。-Enter the right graph with adjacency matrix, the output of the adjacency matrix of a minimum spanning tree, this experiment used the theoretical knowledge Prim algorithm for algorithm design based map G = (V, E), its spanning the vertex set of U. ①, the v0 into U. ②, in all u ∈ U, v ∈ VU edge (u, v) ∈ E in finding a minimum weight edge, by adding spanning tree. ③, ② to find the edge to join the U of v set. If U has a collection of n elements, then the end, otherwise continue ②.
Platform: |
Size: 37888 |
Author: jhp627 |
Hits:
Description: 求最小生成树的实验代码和结果，用到Prim算法-Seeking the minimum spanning tree of the experimental code and results, used Prim algorithm
Platform: |
Size: 876544 |
Author: jhp627 |
Hits:
Description: 图的大部分实现 图的深度优先周游 图的广度优先周游 由队列方式实现的拓扑排序 由深度优先搜索方式实现的拓扑排序 单源最短路径(Dijkstra算法) 每对顶点之间的最短路径(Floyd算法) 最小支撑树(Prim算法) 最小支撑树(Kruskal算法)-Figure most of the implementation diagram of the depth-first breadth-first tour travel map be achieved by the topological sort the queue depth-first search be achieved by the topological sorting single-source shortest path (Dijkstra algorithm) between each pair of vertices the shortest path (Floyd Algorithm ) minimum spanning tree (Prim algorithm) minimum spanning tree (Kruskal algorithm)
Platform: |
Size: 10240 |
Author: fzkj |
Hits:
Description: 应用Prim算法构造最小生成树，是数据结构的节本算法-Application of Prim minimum spanning tree algorithm is constructed, the data section of the structure of the algorithm
Platform: |
Size: 8192 |
Author: ddl |
Hits:
Description: Prim’s Minimum Spanning Tree Algorithm
Platform: |
Size: 61440 |
Author: rockballad |
Hits:
Description: 最小生成树的prim算法。。用邻接矩阵实现-Prim algorithm for minimum spanning tree. . With the adjacency matrix to achieve
Platform: |
Size: 1024 |
Author: 刘芝源 |
Hits:
«
1
2
...
5
6
7
8
9
1011
12
13
14
15
...
21
»